Stochastic Asymmetric Blotto Game Approach for Wireless Resource Allocation Strategies

Evolutionary Dynamics of Resource Allocation in the Colonel Blotto Game

We provide an evolutionary game-theoretical formulation for a model of resource allocation—the Colonel Blotto game. In this game, two players with different total resources must entirely distribute them among a set of items. Each item is won by the player that assigned higher resources to it, and the payoff of each player is the total number of won items. Our evolutionary formulation makes it p...

The Asymmetric Colonel Blotto Game

This paper explores the Nash equilibria of a variant of the Colonel Blotto game, which we call the Asymmetric Colonel Blotto game. In the Colonel Blotto game, two players simultaneously distribute forces across n battlefields. Within each battlefield, the player that allocates the higher level of force wins. The payoff of the game is the proportion of wins on the individual battlefields. In the...

Stochastic asymmetric Blotto games: Some new results

A Stochastic Version of Colonel Blotto Game

We consider a stochastic version of the well-known Blotto game, called the gladiator game. In this zero-sum allocation game two teams of gladiators engage in a sequence of one-to-one fights in which the probability of winning is a function of the gladiators’ strengths. Each team’s strategy consist the allocation of its total strength among its gladiators. We find the Nash equilibria and the val...

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game

In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each battlefield is determined independently by a winner-take-all rule. The ultimate payoff of each colonel is the number of battlefields he wins. The Colonel Blotto game is commonly used for analyzing a wide range of appli...